Maker-Breaker total domination game on cubic graphs
نویسندگان
چکیده
We study Maker--Breaker total domination game played by two players, Dominator and Staller, on the connected cubic graphs. Staller (playing role of Maker) wins if she manages to claim an open neighbourhood a vertex. otherwise (i.e.\ he can dominating set graph). For certain graphs $n\geq 6$ vertices, we give characterization those which are Dominator's win Staller's win.
منابع مشابه
Total domination in cubic Knodel graphs
A subset D of vertices of a graph G is a dominating set if for each u ∈ V (G) \ D, u is adjacent to somevertex v ∈ D. The domination number, γ(G) ofG, is the minimum cardinality of a dominating set of G. A setD ⊆ V (G) is a total dominating set if for eachu ∈ V (G), u is adjacent to some vertex v ∈ D. Thetotal domination number, γt (G) of G, is theminimum cardinality of a total dominating set o...
متن کاملHamiltonian Maker-Breaker games on small graphs
We look at the unbiased Maker-Breaker Hamiltonicity game played on the edge set of a complete graph Kn, where Maker’s goal is to claim a Hamiltonian cycle. First, we prove that, independent of who starts, Maker can win the game for n = 8 and n = 9. Then we use an inductive argument to show that, independent of who starts, Maker can win the game if and only if n ≥ 8. This, in particular, resolve...
متن کاملMaker-breaker games on random geometric graphs
In a Maker-Breaker game on a graph G, Breaker and Maker alternately claim edges of G. Maker wins if, after all edges have been claimed, the graph induced by his edges has some desired property. We consider four Maker-Breaker games played on random geometric graphs. For each of our four games we show that if we add edges between n points chosen uniformly at random in the unit square by order of ...
متن کاملGlobal Maker-Breaker games on sparse graphs
In this paper we consider Maker-Breaker games, played on the edges of sparse graphs. For a given graph property P we seek a graph (board of the game) with the smallest number of edges on which Maker can build a subgraph that satisfies P. In this paper we focus on global properties. We prove the following results: 1) for the positive minimum degree game, there is a winning board with n vertices ...
متن کاملDomination and total domination in cubic graphs of large girth
The domination number γ(G) and the total domination number γt(G) of a graph G without an isolated vertex are among the most well studied parameters in graph theory. While the inequality γt(G) ≤ 2γ(G) is an almost immediate consequence of the definition, the extremal graphs for this inequality are not well understood. Furthermore, even very strong additional assumptions do not allow to improve t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics & Theoretical Computer Science
سال: 2022
ISSN: ['1365-8050', '1462-7264']
DOI: https://doi.org/10.46298/dmtcs.8529